Implementation of Operational calculus on programming spaces with Applications

نویسنده

  • Ziga Sajovic
چکیده

We provide an illustrative implementation of an analytic, infinitelydifferentiable virtual machine, implementing infinitely-differentiable programming spaces and operators acting upon them, as constructed in the paper Operational calculus on programming spaces and generalized tensor networks[1]. Implementation closely follows theorems and derivations of the paper, intended as an educational guide. Analytic virtual machines allow nested transformations, with operational calculus opening new doors in program analysis. We outline the process of employing such a machine to several causes, seamlessly interweaving operational calculus and algorithmic control flow. Nothing at all takes place in the universe in which some rule of maximum or minimum does not appear.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mixing Finite Success and Finite Failure in an Automated Prover

The operational semantics and typing of modern programming and specification languages are often defined using relations and proof systems. In simple settings, logic programming can be used to provide rather direct and natural interpreters for such operational semantics. More complex features of specifications such as names and their bindings, proof rules with negative premise, and the exhausti...

متن کامل

New operational matrix for solving a class of optimal control problems with Jumarie’s modified Riemann-Liouville fractional derivative

In this paper, we apply spectral method based on the Bernstein polynomials for solving a class of optimal control problems with Jumarie’s modified Riemann-Liouville fractional derivative. In the first step, we introduce the dual basis and operational matrix of product based on the Bernstein basis. Then, we get the Bernstein operational matrix for the Jumarie’s modified Riemann-Liouville fractio...

متن کامل

Finite Vector Spaces as Model of Simply-Typed Lambda-Calculi

In this paper we use finite vector spaces (finite dimension, over finite fields) as a non-standard computational model of linear logic. We first define a simple, finite PCF-like lambda-calculus with booleans, and then we discuss two finite models, one based on finite sets and the other on finite vector spaces. The first model is shown to be fully complete with respect to the operational semanti...

متن کامل

Operational Semantics of the Seal Calculus

As a distributed process calculus with localities and mobility of computational entities, Seal calculus is playing an important role in expressing key features such as security and mobility of Internet programming directly. However, little implementation technique proposed for the calculus, partly due to the complication of mobile computation, which fusions three important techniques: concurren...

متن کامل

Modeling Simply-Typed Lambda Calculi in the Category of Finite Vector Spaces

In this paper we use finite vector spaces (finite dimension, over finite fields) as a non-standard computational model of linear logic. We first define a simple, finite PCF-like lambda-calculus with booleans, and then we discuss two finite models, one based on finite sets and the other on finite vector spaces. The first model is shown to be fully complete with respect to the operational semanti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1612.02731  شماره 

صفحات  -

تاریخ انتشار 2016